The Performance Analysis of Nearest Neighbor Query Process using Circular Search Distance
نویسندگان
چکیده
منابع مشابه
Query Point Nearest Neighbor
We explore the eeect of dimensionality on the \nearest neigh-bor" problem. We show that under a broad set of conditions (much broader than independent and identically distributed dimensions), as di-mensionality increases, the distance to the nearest data point approaches the distance to the farthest data point. To provide a practical perspective , we present empirical results on both real and s...
متن کاملQuery-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search
Locality-Sensitive Hashing (LSH) and its variants are the well-known indexing schemes for the c-Approximate Nearest Neighbor (c-ANN) search problem in high-dimensional Euclidean space. Traditionally, LSH functions are constructed in a query-oblivious manner in the sense that buckets are partitioned before any query arrives. However, objects closer to a query may be partitioned into different bu...
متن کاملK-Nearest Neighbor Search for Moving Query Point
This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research and real-life applications. The problem assumes that the query point is not static, as in k-nearest neighbor problem, but varies its position over time. In this paper, four different methods are proposed for solving the problem. D...
متن کاملContinuous Nearest Neighbor Search
A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., “find all my nearest gas stations during my route from point s to point e”). The result contains a set of tuples, such that point is the NN of all points in the corresponding interval. Existing methods for continuous nearest neighbor search are based on the repetitiv...
متن کاملNear-Neighbor Query Performance in Search Trees
Near-neighbor search is an increasingly important operation for queries over multimedia, text, and other non-standard datatypes. In large databases, near-neighbor searches must be enhanced by indexed retrieval for e ciency. In this paper, we present a detailed analysis of three proposals for near-neighbor search: one based on the R-tree, and two which motivated the invention of new trees, namel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Society of Computer and Information
سال: 2010
ISSN: 1598-849X
DOI: 10.9708/jksci.2010.15.1.083